A note on PM-compact bipartite graphs
نویسندگان
چکیده
A graph is called perfect matching compact (briefly, PM -compact), if its perfect matching graph is complete. Matching-covered PM -compact bipartite graphs have been characterized. In this paper, we show that any PM -compact bipartite graph G with δ(G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM -compact, which implies that G is matching-covered.
منابع مشابه
A characterization of PM-compact bipartite and near-bipartite graphs
The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. We characterise bipartite graphs and near-bipartite graphs whose perfect matching polytopes have diameter 1.
متن کاملA note on orthogonal double covers of complete bipartite graphs by a special class of six caterpillars
We construct orthogonal double covers of Kn,n by Pm+1 ∪∗ Sn−m, where n and m are integers, 2 ≤ m ≤ 10, m ≤ n and Pm+1 ∪∗ Sn−m is a tree obtained from the path Pm+1 with m edges and a star Sn−m with n − m edges by identifying an end-vertex of Pm+1 with the center of Sn−m.
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملA generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2014